Primary decomposition of squarefree pseudomonomial ideals
نویسندگان
چکیده
منابع مشابه
A Polarization Operation for Pseudomonomial Ideals
Pseudomonomials and ideals generated by pseudomonomials (pseudomonomial ideals) are a central object of study in the theory of neural rings and neural codes. In the setting of a polynomial ring, we define the polarization operation ρ sending pseudomonomials to squarefree monomials and a further polarization operation P sending pseudomonomial ideals to squarefree monomial ideals. We show for a p...
متن کاملCellular Binomial Ideals. Primary Decomposition of Binomial Ideals
It is known that algorithms exist which compute primary decompositions of polynomial ideals (Gianni et al., 1988; Eisenbud et al., 1992; Becker and Weispfenning, 1993; and more recently Shimoyama and Yokoyama, 1996). However, in case the ideal is binomial, binomiality of its primary components is not assured, that is, the above algorithms do not necessarily compute a decomposition into binomial...
متن کاملPrimary decomposition of the Mayr-Meyer ideals
Grete Hermann proved in H] that for any ideal I in an n-dimensional polynomial ring over the eld of rational numbers, if I is generated by polynomials f 1 ; : : : ; f k of degree at most d, then it is possible to write f = P r i f i such that each r i has degree at most deg f + (kd) (2 n). Mayr and Meyer in MM] found (generators) of ideals for which a doubly exponential bound in n is indeed ach...
متن کاملArithmetical rank of squarefree monomial ideals of small arithmetic degree
In this paper, we prove that the arithmetical rank of a squarefree monomial ideal I is equal to the projective dimension of R/I in the following cases: (a) I is an almost complete intersection; (b) arithdeg I = reg I ; (c) arithdeg I = indeg I + 1. We also classify all almost complete intersection squarefree monomial ideals in terms of hypergraphs, and use this classification in the proof in ca...
متن کاملOn the Stanley Depth of Squarefree Veronese Ideals
Let K be a field and S = K[x1, . . . ,xn]. In 1982, Stanley defined what is now called the Stanley depth of an S-module M, denoted sdepth(M), and conjectured that depth(M) ≤ sdepth(M) for all finitely generated S-modules M. This conjecture remains open for most cases. However, Herzog, Vladoiu and Zheng recently proposed a method of attack in the case when M = I/J with J ⊂ I being monomial S-ide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The journal of software for algebra and geometry
سال: 2022
ISSN: ['1948-7916']
DOI: https://doi.org/10.2140/jsag.2022.12.27